Weighted Bartholdi zeta functions of graphs
نویسنده
چکیده
We define the weighted Bartholdi zeta function of a graph G, and give a determinant expression of it. Furthermore, we define a weighted L-function of G, and present a determinant expression for the weighted L-function of G. As a corollary, we show that the weighted Bartholdi zeta function of a regular covering of G is a product of weighted L-functions of G. © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
Bartholdi zeta functions of graph bundles having regular fibers
As a continuation of computing the Bartholdi zeta function of a regular covering of a graph by Mizuno and Sato in J. Combin. Theory Ser. B 89 (2003) 27, we derive in this paper some computational formulae for the Bartholdi zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the fiber is a Schreier graph or it is regular and the voltages to derive the bundl...
متن کاملA New Determinant Expression for the Weighted Bartholdi Zeta Function of a Digraph
We consider the weighted Bartholdi zeta function of a digraph D, and give a new determinant expression of it. Furthermore, we treat a weighted L-function of D, and give a new determinant expression of it. As a corollary, we present determinant expressions for the Bartholdi edge zeta functions of a graph and a digraph.
متن کاملBartholdi Zeta Functions of Fractal Graphs
Recently, Guido, Isola and Lapidus [11] defined the Ihara zeta function of a fractal graph, and gave a determinant expression of it. We define the Bartholdi zeta function of a fractal graph, and present its determinant expression.
متن کاملBartholdi zeta functions of some graphs
We give a decomposition formula for the Bartholdi zeta function of a graph G which is partitioned into some irregular coverings. As a corollary, we obtain a decomposition formula for the Bartholdi zeta function of G which is partitioned into some regular coverings. © 2005 Elsevier B.V. All rights reserved.
متن کاملThe Weighted Complexity and the Determinant Functions of Graphs
Abstract. The complexity of a graph can be obtained as a derivative of a variation of the zeta function [J. Combin. Theory Ser. B, 74 (1998), pp. 408–410] or a partial derivative of its generalized characteristic polynomial evaluated at a point [arXiv:0704.1431[math.CO]]. A similar result for the weighted complexity of weighted graphs was found using a determinant function [J. Combin. Theory Se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 27 شماره
صفحات -
تاریخ انتشار 2006